Provable Security in Cryptography
نویسنده
چکیده
These lecture notes are a compilation of some of my readings while I was preparing two lectures given at EPFL on provable security in cryptography. They are essentially based on a book chapter from David Pointcheval called “Provable Security for Public Key Schemes” [24], on Victor Shoup’s tutorial on game playing techniques [30], on Coron’s Crypto’00 paper on the exact security of the Full Domain Hash [9], and on Victor Shoup’s Journal of Cryptology paper on OAEP+ [28,29].
منابع مشابه
On Provable Security of Cryptographic Schemes
Provable security is an important issue in modern cryptography because it satisfies the security of the encryption schemes in a theoretical way via a reduction method. To prove the security of a cryptographic scheme, it is necessarry to define the goals and the capabilities of the adversary. In this paper, we explain security models in terms of the adversarial goals and the adversarial capabili...
متن کاملProbabilistic Relational Hoare Logics for Computer-Aided Security Proofs
The provable security paradigm originates from the work of Goldwasser and Micali [10] and plays a central role in modern cryptography. Since its inception, the focus of provable security has gradually shifted towards practice-oriented provable security [4]. The central goal of practice-oriented provable security is to develop and analyze efficient cryptographic systems that can be used for prac...
متن کاملOn Post-Modern Cryptography
This essay relates to a recent article of Koblitz&Menezes that “criticizes several typical ‘provable security’ results” and argues that the “theorem-proof paradigm of theoretical mathematics is often of limited relevance” to cryptography. Although it should be obvious that these claims are utterly wrong, we undertake articulating this triviality. In particular, we point out some of the fundamen...
متن کاملFundamental problems in provable security and cryptography
This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research and dozens of significant results, there are fundamental problems which have yet to be solved. We also present a new approach to one of the more controversial aspects of provable security, the random oracle model.
متن کاملInvariant-based Cryptosystems and Their Security Against Provable Worst-Case Break?
Cryptography based on noncommutative algebra still suffers from lack of schemes and lack of interest. In this work, we show new constructions of cryptosystems based on group invariants and suggest methods to make such cryptosystems secure in practice. Cryptographers still cannot prove security in its cryptographic sense or even reduce it to some statement about regular complexity classes. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007